Grover search revisited: Application to image pattern matching
نویسندگان
چکیده
The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed speedup query complexity. However, there have been no proposal to realize the original motivating application algorithm, i.e., database search or more broadly pattern matching a practical setting, mainly due technical difficulty efficiently implementing data loading and processes. In this paper, we propose that approximately executes entire algorithm. key idea is use recently proposed approximate encoding method on shallow circuit, together easily implementable inversion-test operation realizing projected state having similarity data, followed by independent target index. We provide thorough demonstration problem image matching.
منابع مشابه
Multiple Pattern Matching Revisited
We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...
متن کاملPattern Matching Image Compression
We propose a non-transform image compression scheme based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approzimately occurs in the already processed image. We consider both the Hamming distan...
متن کاملA pattern matching approach to image compression
We propose an image compression scheme based on approximate pattern matching, that we name Pattern Matching Image Compression (PMIC). We give new, eecient algorithms for performing computations motivated by this scheme, and describe the compression ratios experimentally obtained. The main idea is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest p...
متن کاملGrover search algorithm
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed b...
متن کاملDistributed Search and Pattern Matching
Peer-to-peer (P2P) technology has triggered a wide range of distributed applications including file-sharing, distributed XML databases, distributed computing, server-less web publishing and networked resource/service sharing. Despite of the diversity in application, these systems share common requirements for searching due to transitory nodes population and content volatility. In such dynamic e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.105.032440